Group Signatures: Unconditional Security for Members
نویسندگان
چکیده
منابع مشابه
Unconditional Tightness Bounds for Generic Reductions: The Exact Security of Schnorr Signatures, Revisited
A long line of research investigates the existence of tight security reductions for the Schnorr signature scheme. Most of these works presented lower tightness bounds, most recently Seurin (Eurocrypt 2012) showed that under certain assumptions the non-tight security proof for Schnorr signatures by Pointcheval and Stern (Eurocrypt 1996) is essentially optimal. All previous works in this directio...
متن کاملSecurity Flaws in Several Group Signatures Proposed by Popescu
In resent years, Popescu proposed several group signature schemes based on the Okamoto-Shiraishi assumption in [8–11], and claimed his schemes are secure. However, this paper demonstrates that these schemes are all insecure by identifying some security flaws. Exploiting these flaws, an attacker without any secret can mount universally forging attacks. That is, anybody (not necessarily a group m...
متن کاملOn the security of mix-nets and hierarchical group signatures
In this thesis we investigate two separate cryptographic notions: mix-nets and hierarchical group signatures. The former notion was introduced by Chaum (1981). The latter notion is introduced in this thesis, but it generalizes the notion of group signatures which was introduced by Chaum and Heyst (1991). Numerous proposals for mix-nets are given in the literature, but these are presented with i...
متن کاملOn the Security of Dynamic Group Signatures: Preventing Signature Hijacking
We identify a potential weakness in the standard security model for dynamic group signatures which appears to have been overlooked previously. More specifically, we highlight that even if a scheme provably meets the security requirements of the model, a malicious group member can potentially claim ownership of a group signature produced by an honest group member by forging a proof of ownership....
متن کاملUnconditional Security in Quantum Bit Commitment
The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. Gaps in the proof of this impossibility theorem are found....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1994
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v13i481.6954